Self-stabilizing systems in spite of high dynamics

We initiate research on self-stabilization in highly dynamic identified message-passing systems where dynamics is modeled using time-varying graphs (TVGs). More precisely, we address the self-stabilizing leader election problem three wide classes of TVGs: class TCB(Δ) TVGs with temporal diameter bounded by Δ, TCQ(Δ) quasi-bounded and TCR recurrent connectivity only, TCB(Δ)⊆TCQ(Δ)⊆TCR. first study conditions under which our can be solved. introduce notion size-ambiguity to show that assumption knowledge number n processes central. Our results reveal that, despite existence unique process identifiers, any deterministic algorithm working or cannot size-ambiguous, justifying why solutions for those assume exact n. then present algorithms Classes TCB(Δ), TCQ(Δ), TCR, respectively. stabilizes at most 3Δ rounds. However, stabilization time TCR. Nevertheless, circumvent this issue showing are speculative sense their (⊆TCQ(Δ)⊆TCR) O(Δ)